Associative Search on Shogi Game Records

نویسندگان

  • Kobkrit Viriyayudhakorn
  • Mizuhito Ogawa
چکیده

Associative search is information retrieval based on the similarity between two different items of text information. This paper reports experiments on associative search on a large number of short documents containing a small set of words. We also show the extension of the set of words with a semantic relation, and investigate its effect. As an instance, experiments were performed on 49,767 professional (non-handicapped) Shogi game records with 1,923 next move problems for evaluation. The extension of the set of words by pairing under semantic relations, called semantic coupling, is examined to see the effect of enlarging the word space from unigrams to bigrams. Although the search results are not as precise as next move search, we observe improvement by filtering the unigram search result with the bigram search, especially in the early phase of Shogi games. This also fits our general feeling that the bigram search detects castle patterns well.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computer shogi

This paper describes the current state of the art in computer shogi. Shogi (Japanese chess) promises to be a good vehicle for future research into game-playing programs that are based on tree-searching paradigms. This paper shows where chess and shogi are similar, and details the important areas that make shogi programming of particular interest. A crucial difference is the game-tree complexity...

متن کامل

A Randomized Game-Tree Search Algorithm for Shogi Based on Bayesian Approach

We propose a new randomized game-tree search algorithm based on Bayesian Approach. It consists of two main concepts; (1) using multiple game-tree search with a randomized evaluation function as simulations, (2) treating evaluated values as probability distribution and propagating it through the game-tree using the Bayesian Approach concept. Proposed method is focusing on applying to tactical ga...

متن کامل

Large-Scale Optimization for Evaluation Functions with Minimax Search

This paper presents a new method, Minimax Tree Optimization (MMTO), to learn a heuristic evaluation function of a practical alpha-beta search program. The evaluation function may be a linear or non-linear combination of weighted features, and the weights are the parameters to be optimized. To control the search results so that the move decisions agree with the game records of human experts, a w...

متن کامل

Threat stacks to guide pruning and search extensions in shogi

In most cases game programs have to decide their next move under strict time constraints Iterative deepening is the most common method to make sure a move is played that is the result of a completed search to a certain depth To produce a reasonable move at each iteration a combination of pruning techniques and search extensions is used Often the decisions for pruning and extending the search ar...

متن کامل

A Survey of Tsume-Shogi Programs Using Variable-Depth Search

Recently, a number of programs have been developed that successfully apply variable-depth search to find solutions for mating problems in Japanese chess, called tsume shogi. Publications on this research domain have been written mainly in Japanese. To present the findings of this research to a wider audience, we compare six different tsume programs. To find the solutions of difficult tsume-shog...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011